Prediction for discrete time series

Let {Xn} be a stationary and ergodic time series taking values from a finite or countably infinite set X . Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times λn along which we will be able to estimate the conditional probability P (Xλn+1 = x|X0, . . . , Xλn) from data segment (X0, . . . , Xλn) in a pointwise consistent way for a restricted class of stationary and ergodic finite or countably infinite alphabet time series which includes among others all stationary and ergodic finitarily Markovian processes. If the stationary and ergodic process turns out to be finitarily Markovian (among others, all stationary and ergodic Markov chains are included in this class) then limn→∞ n λn > 0 almost surely. If the stationary and ergodic process turns out to possess finite entropy rate then λn is upperbounded by a polynomial, eventually almost surely.